A Self-index on Block Trees
نویسنده
چکیده
The Block Tree is a recently proposed data structure that reaches compression close to Lempel-Ziv while supporting efficient direct access to text substrings. In this paper we show how a self-index can be built on top of a Block Tree so that it provides efficient pattern searches while using space proportional to that of the original data structure. More precisely, if a LempelZiv parse cuts a text of length n into z non-overlapping phrases then our index uses O(z lg(n/z)) words and finds the occ occurrences of a pattern of length m in time O((m + occ) lg n).
منابع مشابه
بررسی زندهمانی و رشد درختان کاج و چنار منتقل شده بر اساس کاربرد هورمون IBA، سن درخت، زمان و نحوه انتقال
The major problems in transplanting the landscape trees are high level of mortality and low establishment rate of transplanted trees, especially in the first year. In order to achieve the best condition for successful transplanting of pine and plane trees in Isfahan landscape, the present study was carried out based on a completely randomized block design with four replicates and three treatmen...
متن کاملChanges of free polyamines in the leaves and stems of ‘Kinnow’ mandarin tree as affected by alternate bearing
In order to investigate the seasonal changes and the possible role of the free polyamines in the leaves and stems on the alternate bearing habit of the ‘Kinnow’ mandarin (Citrus reticulata Blanco) trees, a comparative study was conducted to analyze the levels of free polyamines (putrescine, spermidine and spermine) in the leaves and stems tissues of “on” and &ldquo...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملThe eccentric connectivity index of bucket recursive trees
If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
متن کاملOn trees and the multiplicative sum Zagreb index
For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...
متن کامل